Improved Ant Colony Optimization for the Operational Aircraft Maintenance Routing Problem with Cruise Speed Control
نویسندگان
چکیده
The operational aircraft maintenance routing problem (OAMRP) plays a critical part in producing considerable cost reductions for airlines, since its solution directly influences the number of operating leased aircraft. To reduce quantity required aircraft, adopting cruise speed control OAMRP is good strategy. In this paper, we investigate with control. objective to minimize by finding optimal routes through time optimization. focus on solving two issues simultaneously: (i) optimization times and (ii) determination routes. Since combination intricate sets decisions poses significant methodological challenges, difficulty lies how efficiently solve it. Accordingly, goal study twofold: design preprocessing step network size develop an improved ant colony (IACO) algorithm new state transition mechanism provide guidance pheromone updating enhance search efficiency precision. Using data from Bureau Transportation Statistics (BTS), demonstrate computational IACO algorithm.
منابع مشابه
An improved ant colony optimization for vehicle routing problem
The vehicle routing problem (VRP), a well-known combinatorial optimization problem, holds a central place in logistics management. This paper proposes an improved ant colony optimization (IACO), which possesses a new strategy to update the increased pheromone, called ant-weight strategy, and a mutation operation, to solve VRP. The computational results for fourteen benchmark problems are report...
متن کاملImproved Ant Colony Optimization for Seafood Product Delivery Routing Problem
This paper deals with a real-life vehicle delivery routing problem, which is a seafood product delivery routing problem. Considering the features of the seafood product delivery routing problem, this paper formulated this problem as a multi-depot open vehicle routing problem. Since the multi-depot open vehicle routing problem is a very complex problem, a method is used to reduce the complexity ...
متن کاملAnt Colony Algorithm for the Single Loop Routing Problem
In this paper, a new algorithm for solving the single loop routing problem is presented. The purpose of the single loop routing problem(SLRP) is to find the shortest loop for an automated guided vehicle covering at least one edge of each department of a block layout. First it shown that this problem can be represented as a graph model. Then a meta-heuristic algorithm based on and colony system ...
متن کاملAnt Colony Algorithm for the Single Loop Routing Problem
In this paper, a new algorithm for solving the single loop routing problem is presented. The purpose of the single loop routing problem(SLRP) is to find the shortest loop for an automated guided vehicle covering at least one edge of each department of a block layout. First it shown that this problem can be represented as a graph model. Then a meta-heuristic algorithm based on and colony system ...
متن کاملSolving the Vehicle Routing Problem with Simultaneous Pickup and Delivery by an Effective Ant Colony Optimization
One of the most important extensions of the capacitated vehicle routing problem (CVRP) is the vehicle routing problem with simultaneous pickup and delivery (VRPSPD) where customers require simultaneous delivery and pick-up service. In this paper, we propose an effective ant colony optimization (EACO) which includes insert, swap and 2-Opt moves for solving VRPSPD that is different with common an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Advanced Transportation
سال: 2023
ISSN: ['0197-6729', '2042-3195']
DOI: https://doi.org/10.1155/2023/8390619